منابع مشابه
Computation in Coxeter Groups Ii. Minimal Roots
In the recent paper (Casselman, 2001) I described how a number of ideas due to Fokko du Cloux and myself could be incorporated into a reasonably efficient program to carry out multiplication in arbitrary Coxeter groups. At the end of that paper I discussed how this algorithm could be used to build the reflection table of minimal roots, which could in turn form the basis of a much more efficient...
متن کاملBraided Elements in Coxeter Groups , Ii
We continue the study of freely braided elements of simply laced Coxeter groups, which we introduced in a previous work. A known upper bound for the number of commutation classes of reduced expressions for an element of a simply laced Coxeter group is shown to be achieved only when the element is freely braided; this establishes the converse direction of a previous result. It is also shown that...
متن کاملCoxeter Covers of the Classical Coxeter Groups
Let C(T ) be a generalized Coxeter group, which has a natural map onto one of the classical Coxeter groups, either Bn or Dn. Let CY (T ) be a natural quotient of C(T ), and if C(T ) is simply-laced (which means all the relations between the generators has order 2 or 3), CY (T ) is a generalized Coxeter group, too . Let At,n be a group which contains t Abelian groups generated by n elements. The...
متن کاملEssays on Coxeter groups Coxeter elements in finite Coxeter groups
A finite Coxeter group possesses a distinguished conjugacy class of Coxeter elements. The literature about these is very large, but it seems to me that there is still room for a better motivated account than what exists. The standard references on thismaterial are [Bourbaki:1968] and [Humphreys:1990], butmy treatment follows [Steinberg:1959] and [Steinberg:1985], from which the clever parts of ...
متن کاملArtin Groups and Coxeter Groups
where the words on each side of these relations are sequences of mij letters where ai and aj alternate in the sequence. The matrix of values mij is a Coxeter matrix M = (mij)i,j∈I on I. These groups generalize the braid groups established in 1925 by E. Artin in a natural way and therefore we suggest naming them Artin groups. If one adds the relations ai = 1 to the relations in the presentation ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1977
ISSN: 0021-8693
DOI: 10.1016/0021-8693(77)90184-3